The Asymptotic Induced Matching Number of Hypergraphs: Balanced Binary Strings
نویسندگان
چکیده
منابع مشابه
'The Asymptotic Number of Connected d-Uniform Hypergraphs' - CORRIGENDUM
MICHAEL BEHRISCH1† , AMIN COJA-OGHLAN2‡ and MIHYUN KANG3§ 1 Institute of Transportation Systems, German Aerospace Center, Rutherfordstrasse 2, 12489 Berlin, Germany (e-mail: [email protected]) 2 Goethe University, Mathematics Institute, 60054 Frankfurt am Main, Germany (e-mail: [email protected]) 3 TU Graz, Institut für Optimierung und Diskrete Mathematik (Math B), Steyrergas...
متن کاملThe Asymptotic Number of Connected d-Uniform Hypergraphs
For d ≥ 2, let Hd(n, p) denote a random d-uniform hypergraph with n vertices in which each of the ( n d ) possible edges is present with probability p = p(n) independently, and let Hd(n,m) denote a uniformly distributed d-uniform hypergraph with n vertices and m edges. Let either H = Hd(n,m) or H = Hd(n, p), where m/n and ( n−1 d−1 ) p need to be bounded away from (d− 1)−1 and 0 respectively. W...
متن کاملThe asymptotic number of binary codes and binary matroids
The asymptotic number of nonequivalent binary n-codes is determined. This is also the asymptotic number of nonisomorphic binary n-matroids.
متن کاملEfficient Pattern Matching on Binary Strings
The binary string matching problem consists in finding all the occurrences of a pattern in a text where both strings are built on a binary alphabet. This is an interesting problem in computer science, since binary data are omnipresent in telecom and computer network applications. Moreover the problem finds applications also in the field of image processing and in pattern matching on compressed ...
متن کاملAsymptotic Mutual Information for the Balanced Binary Stochastic Block Model
We develop an information-theoretic view of the stochastic block model, a popular statistical model for the large-scale structure of complex networks. A graph G from such a model is generated by first assigning vertex labels at random from a finite alphabet, and then connecting vertices with edge probabilities depending on the labels of the endpoints. In the case of the symmetric two-group mode...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2020
ISSN: 1077-8926
DOI: 10.37236/9019